A strip-like tiling algorithm
نویسندگان
چکیده
منابع مشابه
Tiling a Strip with Triangles
In this paper, we examine the tilings of a 2 × n “triangular strip” with triangles. These tilings have connections with Fibonacci numbers, Pell numbers, and other known sequences. We will derive several different recurrences, establish some properties of these numbers, and give a refined count for these tilings (i.e., by the number and type of triangles used) and establish several properties of...
متن کاملPolyominoes tiling by a genetic algorithm
Most existing placement algorithms were designed to handle blocks that are rectangular in shape. In this paper, we show how a genetic algorithm (GA) is used to construct an optimal arrangement of two-dimensional rectilinear blocks. Our approach does not require the orientation of each block to be fixed. To transform the placement problem to a GA problem, we devised a decoding technique known as...
متن کاملA linear algorithm for Brick Wang tiling
In computer graphics, Wang tiles are used as a tool to generate non periodic textures and patterns. We develop a framework and a method for the tiling problem which is suitable for applications. In particular, we apply our methodology to a special kind of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2015 to model wall patterns. We generalise their result by provi...
متن کاملA Stable and Efficient Loop Tiling Algorithm
Loop tiling is an effective optimizing transformation to boost the memory performance of a program, especially for dense matrix scientific computations. The magnitude and stability of the achieved performance improvements is heavily dependent on the appropriate selection of tile sizes. Many existing tile selection algorithms try to find tile sizes which eliminate self-interference cache conflic...
متن کاملA Tiling Algorithm for High School Timetabling
This paper presents a tiling algorithm for high school timetabling. The meetings are grouped into small, regular clusters called tiles, each of which is thereafter treated as a unit. Experiments with three actual instances show that tiling, coupled with an alternating path algorithm for assigning resources to meetings after times are fixed, produces good, comprehensible timetables in about ten ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00074-3